Hierarchies Relating Topology and Geometry
نویسندگان
چکیده
Cognitive Vision has to represent, reason and learn about objects in its environment it has to manipulate and react to. There are deformable objects like humans which cannot be described easily in simple geometric terms. In many cases they are composed of several pieces forming a “structured subset” of R or Z. We introduce the potential topological representations for structured objects: plane graphs, combinatorial and generalized maps. They capture abstract spatial relations derived from geometry and enable reconstructions through attributing the relations by e.g. coordinates. In addition they offer the possibility to combine both topology and geometry in a hierarchical framework: irregular pyramids. The basic operations to construct these hierarchies are edge contraction and edge removal. We show preliminary results in using them to hold a whole set of segmentations of an image that enable reasoning and planning actions at various levels of detail down to a single pixel in a homogeneous way. We further speculate that the higher levels map the inherent structure of objects and can be used to integrate (and “learn”) the specific object properties over time by up-projecting individual measurements. The construction of the hierarchies follows the philosophy to reduce the data amount at each higher level of the hierarchy by a reduction factor > 1 while preserving important topological properties like connectivity and inclusion.
منابع مشابه
A Geometry Preserving Kernel over Riemannian Manifolds
Abstract- Kernel trick and projection to tangent spaces are two choices for linearizing the data points lying on Riemannian manifolds. These approaches are used to provide the prerequisites for applying standard machine learning methods on Riemannian manifolds. Classical kernels implicitly project data to high dimensional feature space without considering the intrinsic geometry of data points. ...
متن کاملRelating network rigidity, time scale hierarchies, and expression noise in gene networks.
Fluctuation-dissipation theorems can be used to predict characteristics of noise from characteristics of the macroscopic response of a system. In the case of gene networks, feedback control determines the "network rigidity," defined as resistance to slow external changes. We propose an effective Fokker-Planck equation that relates gene expression noise to topology and to time scales of the gene...
متن کاملConstruction of Hexahedral Block Topology and its Decomposition to Generate Initial Tetrahedral Grids for Aerodynamic Applications
Making an initial tetrahedral grid for complex geometry can be a tedious and time consuming task. This paper describes a novel procedure for generation of starting tetrahedral cells using hexahedral block topology. Hexahedral blocks are arranged around an aerodynamic body to form a flow domain. Each of the hexahedral blocks is then decomposed into six tetrahedral elements to obtain an initial t...
متن کاملRelating Hierarchy of Linear Temporal Properties to Model Checking Relating Hierarchy of Linear Temporal Properties to Model Checking
The hierarchy of properties as overviewed by Manna and Pnueli 23] relates language, topology, !-automata, and linear temporal logic classiications of properties. We provide new characterisations of this hierarchy in terms of automata with B uchi, coB uchi, and Streett acceptance condition and in terms of LTL i and LTL i hierarchies. Afterwards, we analyse the complexity of the model checking pr...
متن کاملRhombellanic Crystals and Quasicrystals
Design of some crystal and quasicrystal networks, based on rhombellane tiling,is presented. [1,1,1]Propellane,is a synthesized organic molecule; its hydrogenated form, the bicyclo[1.1.1]pentane,may be represented by the complete bipartite graph K2,3 which is the smallest rhombellane. Topology of translational and radial structures involving rhombellanes is described in terms of vertex symbol, c...
متن کامل